Answering UCQs under Updates and in the Presence of Integrity Constraints

We investigate the query evaluation problem for fixed queries over fully dynamic databases where tuples can be inserted or deleted. The task is to design a dynamic data structure that can immediately report the new result of a fixed query after every database update. We consider unions of conjunctive queries (UCQs) and focus on the query evaluation tasks testing (decide whether an input tuple belongs to the query result), enumeration (enumerate, without repetition, all tuples in the query result), and counting (output the number of tuples in the query result). We identify three increasingly restrictive classes of UCQs which we call t-hierarchical, q-hierarchical, and exhaustively q-hierarchical UCQs. Our main results provide the following dichotomies: If the query\u27s homomorphic core is t-hierarchical (q-hierarchical, exhaustively q-hierarchical), then the testing (enumeration, counting) problem can be solved with constant update time and constant testing time (delay, counting time). Otherwise, it cannot be solved with sublinear update time and sublinear testing time (delay, counting time), unless the OV-conjecture and/or the OMv-conjecture fails. We also study the complexity of query evaluation in the dynamic setting in the presence of integrity constraints, and we obtain similar dichotomy results for the special case of small domain constraints (i.e., constraints which state that all values in a particular column of a relation belong to a fixed domain of constant size)

Answering FO+MOD Queries Under Updates on Bounded Degree Databases

We investigate the query evaluation problem for fixed queries over fully dynamic databases, where tuples can be inserted or deleted. The task is to design a dynamic algorithm that immediately reports the new result of a fixed query after every database update. We consider queries in first-order logic (FO) and its extension with modulo-counting quantifiers (FO+MOD), and show that they can be efficiently evaluated under updates, provided that the dynamic database does not exceed a certain degree bound. In particular, we construct a data structure that allows to answer a Boolean FO+MOD query and to compute the size of the query result within constant time after every database update. Furthermore, after every update we are able to immediately enumerate the new query result with constant delay between the output tuples. The time needed to build the data structure is linear in the size of the database. Our results extend earlier work on the evaluation of first-order queries on static databases of bounded degree and rely on an effective Hanf normal form for FO+MOD recently obtained by [Heimberg, Kuske, and Schweikardt, LICS, 2016]

The Berry-Keating operator on a lattice

We construct and study a version of the Berry-Keating operator with a built-in truncation of the phase space, which we choose to be a two-dimensional torus. The operator is a Weyl quantisation of the classical Hamiltonian for an inverted harmonic oscillator, producing a difference operator on a finite, periodic lattice. We investigate the continuum and the infinite-volume limit of our model in conjunction with the semiclassical limit. Using semiclassical methods, we show that a specific combination of the limits leads to a logarithmic mean spectral density as it was anticipated by Berry and Keating

The Berry-Keating operator on a lattice

We construct and study a version of the Berry-Keating operator with a built-in truncation of the phase space, which we choose to be a two-dimensional torus. The operator is a Weyl quantisation of the classical Hamiltonian for an inverted harmonic oscillator, producing a difference operator on a finite, periodic lattice. We investigate the continuum and the infinite-volume limit of our model in conjunction with the semiclassical limit. Using semiclassical methods, we show that a specific combination of the limits leads to a logarithmic mean spectral density as it was anticipated by Berry and Keating

Work-Efficient Query Evaluation with PRAMs

The paper studies query evaluation in parallel constant time in the PRAM model. While it is well-known that all relational algebra queries can be evaluated in constant time on an appropriate CRCW-PRAM, this paper is interested in the efficiency of evaluation algorithms, that is, in the number of processors or, asymptotically equivalent, in the work. Naive evaluation in the parallel setting results in huge (polynomial) bounds on the work of such algorithms and in presentations of the result sets that can be extremely scattered in memory. The paper first discusses some obstacles for constant time PRAM query evaluation. It presents algorithms for relational operators that are considerably more efficient than the naive approaches. Further it explores three settings, in which efficient sequential query evaluation algorithms exist: acyclic queries, semi-join algebra queries, and join queries - the latter in the worst-case optimal framework. Under natural assumptions on the representation of the database, the work of the given algorithms matches the best sequential algorithms in the case of semi-join queries, and it comes close in the other two settings. An important tool is the compaction technique from Hagerup (1992)

Rewriting with Acyclic Queries: Mind Your Head

The paper studies the rewriting problem, that is, the decision problem whether, for a given conjunctive query Q and a set ? of views, there is a conjunctive query Q\u27 over ? that is equivalent to Q, for cases where the query, the views, and/or the desired rewriting are acyclic or even more restricted. It shows that, if Q itself is acyclic, an acyclic rewriting exists if there is any rewriting. An analogous statement also holds for free-connex acyclic, hierarchical, and q-hierarchical queries. Regarding the complexity of the rewriting problem, the paper identifies a border between tractable and (presumably) intractable variants of the rewriting problem: for schemas of bounded arity, the acyclic rewriting problem is NP-hard, even if both Q and the views in ? are acyclic or hierarchical. However, it becomes tractable, if the views are free-connex acyclic (i.e., in a nutshell, their body is (i) acyclic and (ii) remains acyclic if their head is added as an additional atom)

The spin contribution to the form factor of quantum graphs

Following the quantisation of a graph with the Dirac operator (spin-1/2) we explain how additional weights in the spectral form factor K(\tau) due to spin propagation around orbits produce higher order terms in the small-\tau asymptotics in agreement with symplectic random matrix ensembles. We determine conditions on the group of spin rotations sufficient to generate CSE statistics.Comment: 9 page

Intermediate statistics in quantum maps

We present a one-parameter family of quantum maps whose spectral statistics are of the same intermediate type as observed in polygonal quantum billiards. Our central result is the evaluation of the spectral two-point correlation form factor at small argument, which in turn yields the asymptotic level compressibility for macroscopic correlation lengths